|
Applicative computing systems, or ACS are the systems of object calculi founded on combinatory logic and lambda calculus.〔Wolfengagen V.E. ''Methods and means for computations with objects. Applicative Computational Systems.'' — M.: JurInfoR Ltd., «Center JurInfoR», 2004. — xvi+789 pp. ISBN 5-89158-100-0.〕 The only essential notion which is under consideration in these systems is the representation of object. In combinatory logic the only metaoperator is application in a sense of applying one object to other. In lambda calculus two metaoperators are used: application – the same as in combinatory logic, and functional abstraction which binds the only variable in one object. == Features of ACS == The objects generated in these systems are the functional entities with the following features: # the number of argument places, or object arity is not fixed but is enabling step by step in interoperations with other objects; # in a process of generating the compound object one of its counterparts—function, -- is applied to other one—argument, -- but in other contexts they can change their roles, i.e. functions and arguments are considered on the equal rights; # the self-applying of functions is allowed, i.e. any object can be applied to itself. ACS give a sound ground for applicative approach to programming. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Applicative computing systems」の詳細全文を読む スポンサード リンク
|